A Note on Shellability of Hypergraph Arrangements
نویسنده
چکیده
For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown to have shellable intersection lattices.
منابع مشابه
A note on shellability and acyclic orientations
In this short note we discuss the shellability of (nonpure) simplicial complexes in terms of acyclic orientations of the facet-ridge incidence graphs, which shows that we can decide shellability only from the facet-ridge incidences and the total number of faces the simplicial complex contains. © 2007 Elsevier B.V. All rights reserved.
متن کاملMatroid Shellability , β - Systems and Affine Hyperplane Arrangements
The broken circuit complex plays a fundamental role for the shellability and homology of matroids, geometric lattices and linear hyperplane arrangements. Here we introduce and study the β-system of a matroid, βnbc(M), whose cardinality is Crapo’s β-invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices and affine hyperplane arrangements, we find th...
متن کاملShellability of Posets of Labeled Partitions and Arrangements Defined by Root Systems
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby’s description of such posets by means of “labeled partitions”: after giving an EL-labeling and counting homology chains for general posets of labeled partitions, we obtain the stated results by...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کامل